Current Issue : April - June Volume : 2012 Issue Number : 2 Articles : 4 Articles
In this article, we present an automatic face recognition system. We show that fractal features obtained from\r\nIterated Function System allow a successful face recognition and outperform the classical approaches. We propose\r\na new fractal feature extraction algorithm based on genetic algorithms to speed up the feature extraction step. In\r\norder to capture the more important information that is contained in a face with a few fractal features, we use a\r\nbi-dimensional principal component analysis. We have shown with experimental results using two databases as to\r\nhow the optimal recognition ratio and the recognition time make our system an effective tool for automatic face\r\nrecognition....
Form a privacy perspective most concerns against the common use of biometrics arise from the storage and\r\nmisuse of biometric data. Biometric cryptosystems and cancelable biometrics represent emerging technologies of\r\nbiometric template protection addressing these concerns and improving public confidence and acceptance of\r\nbiometrics. In addition, biometric cryptosystems provide mechanisms for biometric-dependent key-release. In the\r\nlast years a significant amount of approaches to both technologies have been published. A comprehensive survey\r\nof biometric cryptosystems and cancelable biometrics is presented. State-of-the-art approaches are reviewed based\r\non which an in-depth discussion and an outlook to future prospects are given....
Recent experimental work by Androulidakis and Papavassiliou (IET Commun 2(3):399, 2008; IEEE Netw 23(1):6, 2009)\r\nhas shown that it is possible to maintain a high level of network security while selectively inspecting packets for\r\nthe existence of intrusive activity, thereby resulting in a minimal amount of processing overhead. In this paper, a\r\nstatistical approach for the modeling of network intrusions as Markov processes is introduced. The theoretical\r\nfindings presented here confirm the earlier experimental results of Androulidakis and Papavassiliou. A common\r\nnotion about network intrusion detection systems is that every packet arriving into a network must be inspected\r\nin order to prevent intrusions. This investigation, together with the earlier experimental results, disproves that\r\nnotion. Additional experimental testing of a corporate local area network is reported....
Denial-of-service (DoS) attack exploits inherent limitation of resources in wireless networks in attempt to\r\noverwhelm and exhaust their finite capacity. In wireless networks, clear-text form of control packets (CP) exhibits a\r\nsecurity flaw that can be exploited by attackers to render the networks incapable of providing normal services.\r\nWhile these attacks are quite damaging in terms of consuming available processing and bandwidth resources, they\r\nare easy to conduct against the wireless networks. In this study, we propose two distinct models to prevent\r\nwireless DoS and replay attacks based on trust in CP for IEEE 802.11 wireless networks. The first model is based on\r\noriginal HMAC-SHA1 algorithm and the second one is based on a proposed modified HMAC-SHA1 (M-hmac)\r\nalgorithm. Both models are implemented and the results are obtained and evaluated based on a number of\r\nmetrics. The results show that the two models successfully prevent both wireless DoS and replay attacks. In\r\naddition, the newly proposed M-hmac algorithm provides better network performance in term of the metrics....
Loading....